Efficient Sequential and Parallel Prime Sieve Algorithms

Generating prime numbers less than or equal to an integer number m plays important role in many asymmetric key cryptosystems. Recently, a new sequential sieve algorithm was proposed based on set theory. The main drawback of this is that the running time and storage are high when size large. This paper introduces three algorithms for two approaches. first approach develops fast theory some structural improvements recent algorithm. second parallel shared memory model static dynamic strategies. analysis experimental studies shows following results. (1) outperforms terms by 98% consumption 80%, average. (2) outperform 72% 67%, respectively, (3) maximum speedups achieved using 16 threads 7 4.5, respectively. As result, more effective time, scalability generating primes.